________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:14:33
Input Data from:  dataset106.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,134
Average f[i]   :4000
Average g[i,j] :1956,25
Total demand   :4840
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	0	1	-1	2	5000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 8
> Selected Move:	640	1	-1	7	10000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0    >new incumb.: 640


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	940	1	-1	6	14500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  0    >new incumb.: 940


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	1300	1	-1	8	19000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0    >new incumb.: 1300


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 35
> Selected Move:	1400	3	7	5	19000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0    >new incumb.: 1400


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 35
> Selected Move:	1400	3	6	9	19000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 35
> Selected Move:	1390	3	2	4	19000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 36
> Selected Move:	1390	3	5	7	19000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 36
> Selected Move:	1390	3	9	6	19000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 35
> Selected Move:	1390	3	7	5	19000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 35
> Selected Move:	1280	3	4	7	19000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 34
> Selected Move:	1280	3	6	9	19000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 34
> Selected Move:	1300	3	5	2	19000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 34
> Selected Move:	1140	3	7	4	19000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 33
> Selected Move:	1240	3	9	5	19500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 32
> Selected Move:	1240	3	2	7	19500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 28
> Selected Move:	1240	3	8	6	19500


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 33
> Selected Move:	1240	3	6	9	19500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 32
> Selected Move:	1140	3	7	2	19500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 32
> Selected Move:	1140	3	9	6	19500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 32
> Selected Move:	1140	3	5	8	19000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 30
> Selected Move:	1080	3	6	7	19500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 29
> Selected Move:	1100	3	4	5	19500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 29
> Selected Move:	1100	3	8	6	19500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 31
> Selected Move:	1100	3	6	9	19500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 31
> Selected Move:	1080	3	5	4	19500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 30
> Selected Move:	1080	3	9	5	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 24
> Selected Move:	1080	3	5	6	19500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 29
> Selected Move:	1000	3	4	9	19000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 33
> Selected Move:	990	3	2	5	19000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 33
> Selected Move:	990	3	7	2	19000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 32
> Selected Move:	990	2	6	-1	14500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 33
> Selected Move:	1100	3	9	8	14500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 32
> Selected Move:	1170	3	2	4	14500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 32
> Selected Move:	1080	3	5	7	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 35
> Selected Move:	980	3	8	6	14500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 35
> Selected Move:	980	3	6	9	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 35
> Selected Move:	980	3	7	5	14500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 34
> Selected Move:	980	3	9	6	14500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 34
> Selected Move:	990	3	4	2	14500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 32
> Selected Move:	920	3	0	7	16100


> New Y[]: 
	
	 0  3  1  0  0  1  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	7	2	16500


> New Y[]: 
	
	 0  3  2  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	2	5	16400


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 26
> Selected Move:	920	4	5	6	16700


> New Y[]: 
	
	 0  3  1  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 28
> Selected Move:	920	3	2	4	16700


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	6	4	17000


> New Y[]: 
	
	 0  3  0  0  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 26
> Selected Move:	920	4	4	5	16400


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 25
> Selected Move:	975	1	-1	8	20900


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 24
> Selected Move:	1066	4	5	7	20600


> New Y[]: 
	
	 0  3  0  0  1  1  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 24
> Selected Move:	1069	3	6	9	20600


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 24
> Selected Move:	988	4	7	5	20900


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 23
> Selected Move:	920	2	8	-1	16400


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 26
> Selected Move:	920	4	5	4	17000


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 27
> Selected Move:	920	4	4	7	16100


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 25
> Selected Move:	920	4	7	9	16800


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 26
> Selected Move:	920	3	4	2	16800


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 27
> Selected Move:	920	4	9	2	16500


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 26
> Selected Move:	920	4	2	5	16400


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 25
> Selected Move:	940	3	5	0	14500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 31
> Selected Move:	940	3	9	8	14500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 31
> Selected Move:	920	3	0	5	16400


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 26
> Selected Move:	920	4	5	2	16500


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 26
> Selected Move:	920	4	2	7	16100


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 26
> Selected Move:	971	1	-1	6	20600


> New Y[]: 
	
	 0  3  1  0  0  1  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 25
> Selected Move:	974	3	6	9	20600


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 25
> Selected Move:	957	3	5	4	20600


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 24
> Selected Move:	960	3	7	5	20900


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 24
> Selected Move:	965	3	9	6	20900


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,2

## ITERATION 68 #######################


> Neighbours evaluated; 24
> Selected Move:	960	3	5	7	20600


> New Y[]: 
	
	 0  3  1  0  1  0  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,205

## ITERATION 69 #######################


> Neighbours evaluated; 24
> Selected Move:	875	4	7	2	21000


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,21

## ITERATION 70 #######################


> Neighbours evaluated; 24
> Selected Move:	930	3	7	5	21000


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,215

## ITERATION 71 #######################


> Neighbours evaluated; 23
> Selected Move:	925	3	6	9	21000


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,22

## ITERATION 72 #######################


> Neighbours evaluated; 23
> Selected Move:	894	3	2	3	20800


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,225

## ITERATION 73 #######################


> Neighbours evaluated; 23
> Selected Move:	920	3	4	7	20800


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,23

## ITERATION 74 #######################


> Neighbours evaluated; 28
> Selected Move:	916	3	9	6	20800


> New Y[]: 
	
	 0  3  0  2  0  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 75 #######################


> Neighbours evaluated; 28
> Selected Move:	890	2	6	-1	16300


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,24

## ITERATION 76 #######################


> Neighbours evaluated; 23
> Selected Move:	920	3	3	0	14500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 77 #######################


> Neighbours evaluated; 30
> Selected Move:	920	3	0	4	17000


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,25

## ITERATION 78 #######################


> Neighbours evaluated; 24
> Selected Move:	920	4	4	5	16400


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,255

## ITERATION 79 #######################


> Neighbours evaluated; 22
> Selected Move:	920	4	5	7	16100


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,26

## ITERATION 80 #######################


> Neighbours evaluated; 22
> Selected Move:	920	4	7	8	17000


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,255

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	920	3	4	2	17000


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 82 #######################


> Neighbours evaluated; 25
> Selected Move:	920	3	8	0	15000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 83 #######################


> Neighbours evaluated; 25
> Selected Move:	920	3	1	6	17000


> New Y[]: 
	
	 2  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 84 #######################


> Neighbours evaluated; 31
> Selected Move:	920	4	6	2	16800


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 85 #######################


> Neighbours evaluated; 31
> Selected Move:	920	4	2	5	16800


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 86 #######################


> Neighbours evaluated; 30
> Selected Move:	920	4	5	7	16100


> New Y[]: 
	
	 2  0  1  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 87 #######################


> Neighbours evaluated; 31
> Selected Move:	965	1	-1	8	20600


> New Y[]: 
	
	 2  0  1  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,22

## ITERATION 88 #######################


> Neighbours evaluated; 29
> Selected Move:	1108	3	2	4	20600


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,215

## ITERATION 89 #######################


> Neighbours evaluated; 28
> Selected Move:	1111	3	6	9	20600


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,21

## ITERATION 90 #######################


> Neighbours evaluated; 30
> Selected Move:	1093	4	7	4	20700


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,205

## ITERATION 91 #######################


> Neighbours evaluated; 30
> Selected Move:	1097	3	9	6	20700


> New Y[]: 
	
	 2  0  0  0  3  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,21

## ITERATION 92 #######################


> Neighbours evaluated; 29
> Selected Move:	993	3	7	2	20700


> New Y[]: 
	
	 2  0  1  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,215

## ITERATION 93 #######################


> Neighbours evaluated; 28
> Selected Move:	990	3	6	9	20700


> New Y[]: 
	
	 2  0  1  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,22

## ITERATION 94 #######################


> Neighbours evaluated; 28
> Selected Move:	968	3	4	7	20600


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,225

## ITERATION 95 #######################


> Neighbours evaluated; 28
> Selected Move:	945	3	5	4	20600


> New Y[]: 
	
	 2  0  1  0  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,23

## ITERATION 96 #######################


> Neighbours evaluated; 28
> Selected Move:	942	3	9	6	20600


> New Y[]: 
	
	 2  0  1  0  1  0  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 97 #######################


> Neighbours evaluated; 27
> Selected Move:	916	4	7	4	20700


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,24

## ITERATION 98 #######################


> Neighbours evaluated; 27
> Selected Move:	912	3	6	9	20700


> New Y[]: 
	
	 2  0  1  0  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,245

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	809	3	8	6	20700


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 100 #######################


> Neighbours evaluated; 28
> Selected Move:	830	4	4	7	20600


> New Y[]: 
	
	 2  0  1  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 101 #######################


> Neighbours evaluated; 26
> Selected Move:	980	3	7	1	19000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 102 #######################


> Neighbours evaluated; 32
> Selected Move:	980	3	2	5	19000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 103 #######################


> Neighbours evaluated; 30
> Selected Move:	980	3	5	7	19000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 104 #######################


> Neighbours evaluated; 29
> Selected Move:	800	3	6	3	21000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 105 #######################


> Neighbours evaluated; 28
> Selected Move:	993	3	4	8	20500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 106 #######################


> Neighbours evaluated; 35
> Selected Move:	990	3	7	5	20500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 107 #######################


> Neighbours evaluated; 34
> Selected Move:	988	3	9	6	20500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 108 #######################


> Neighbours evaluated; 34
> Selected Move:	985	3	5	7	20500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 109 #######################


> Neighbours evaluated; 33
> Selected Move:	923	3	7	4	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 110 #######################


> Neighbours evaluated; 33
> Selected Move:	940	3	6	5	21000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 111 #######################


> Neighbours evaluated; 24
> Selected Move:	918	3	5	9	20500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 112 #######################


> Neighbours evaluated; 28
> Selected Move:	845	3	4	2	20500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 113 #######################


> Neighbours evaluated; 31
> Selected Move:	843	3	9	6	20500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 114 #######################


> Neighbours evaluated; 30
> Selected Move:	780	3	6	5	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 115 #######################


> Neighbours evaluated; 23
> Selected Move:	890	2	2	-1	16000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 116 #######################


> Neighbours evaluated; 33
> Selected Move:	910	3	5	7	16000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,335

## ITERATION 117 #######################


> Neighbours evaluated; 34
> Selected Move:	890	3	0	5	17900


> New Y[]: 
	
	 0  3  0  1  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,34

## ITERATION 118 #######################


> Neighbours evaluated; 23
> Selected Move:	890	4	5	7	17600


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,345

## ITERATION 119 #######################


> Neighbours evaluated; 22
> Selected Move:	890	4	7	8	18500


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,35

## ITERATION 120 #######################


> Neighbours evaluated; 23
> Selected Move:	890	3	8	0	16500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,345

## ITERATION 121 #######################


> Neighbours evaluated; 35
> Selected Move:	920	3	3	4	15000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 122 #######################


> Neighbours evaluated; 24
> Selected Move:	920	3	1	6	17000


> New Y[]: 
	
	 2  0  0  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,335

## ITERATION 123 #######################


> Neighbours evaluated; 30
> Selected Move:	920	4	6	4	16200


> New Y[]: 
	
	 2  0  0  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,33

## ITERATION 124 #######################


> Neighbours evaluated; 29
> Selected Move:	920	4	4	5	16800


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,325

## ITERATION 125 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	5	7	16100


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,32

## ITERATION 126 #######################


> Neighbours evaluated; 28
> Selected Move:	920	3	6	8	16100


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,315

## ITERATION 127 #######################


> Neighbours evaluated; 29
> Selected Move:	920	4	7	4	16200


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,31

## ITERATION 128 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	4	5	16800


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,305

## ITERATION 129 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	5	8	17100


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,3

## ITERATION 130 #######################


> Neighbours evaluated; 28
> Selected Move:	920	3	4	2	17100


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 131 #######################


> Neighbours evaluated; 29
> Selected Move:	920	4	8	2	16800


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 132 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	2	5	16800


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	920	4	5	7	16100


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 134 #######################


> Neighbours evaluated; 27
> Selected Move:	920	3	8	9	16100


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 135 #######################


> Neighbours evaluated; 29
> Selected Move:	920	4	7	2	16800


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 136 #######################


> Neighbours evaluated; 29
> Selected Move:	920	4	2	5	16800


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 137 #######################


> Neighbours evaluated; 27
> Selected Move:	920	4	5	9	17000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 138 #######################


> Neighbours evaluated; 28
> Selected Move:	920	3	2	4	17000


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,255

## ITERATION 139 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	9	4	16200


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,25

## ITERATION 140 #######################


> Neighbours evaluated; 28
> Selected Move:	920	4	4	5	16800


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,245

## ITERATION 141 #######################


> Neighbours evaluated; 27
> Selected Move:	922	1	-1	8	21300


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,24

## ITERATION 142 #######################


> Neighbours evaluated; 25
> Selected Move:	928	3	9	6	21300


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 143 #######################


> Neighbours evaluated; 24
> Selected Move:	888	4	5	6	21500


> New Y[]: 
	
	 2  0  0  0  1  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,23

## ITERATION 144 #######################


> Neighbours evaluated; 25
> Selected Move:	895	3	6	9	21500


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,225

## ITERATION 145 #######################


> Neighbours evaluated; 24
> Selected Move:	880	4	9	8	21600


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,23

## ITERATION 146 #######################


> Neighbours evaluated; 25
> Selected Move:	872	3	9	6	21600


> New Y[]: 
	
	 2  0  0  0  1  1  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 147 #######################


> Neighbours evaluated; 24
> Selected Move:	770	4	0	4	19100


> New Y[]: 
	
	 0  0  0  0  2  1  1  1  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,24

## ITERATION 148 #######################


> Neighbours evaluated; 19
> Selected Move:	780	3	6	2	19600


> New Y[]: 
	
	 0  0  1  0  2  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,245

## ITERATION 149 #######################


> Neighbours evaluated; 6
> Selected Move:	780	4	4	2	19100


> New Y[]: 
	
	 0  0  2  0  1  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,25

## ITERATION 150 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	5	19000


> New Y[]: 
	
	 0  0  1  0  1  2  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,255

## ITERATION 151 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	5	7	18700


> New Y[]: 
	
	 0  0  1  0  1  1  0  2  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,26

## ITERATION 152 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	7	8	18600


> New Y[]: 
	
	 0  0  1  0  1  1  0  3  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,255

## ITERATION 153 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	7	2	19300


> New Y[]: 
	
	 0  0  3  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,25

## ITERATION 154 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	4	18700


> New Y[]: 
	
	 0  0  1  0  3  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,245

## ITERATION 155 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	4	5	19300


> New Y[]: 
	
	 0  0  1  0  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,24

## ITERATION 156 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	8	2	18800


> New Y[]: 
	
	 0  0  2  0  1  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,235

## ITERATION 157 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	4	19300


> New Y[]: 
	
	 0  0  1  0  2  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,23

## ITERATION 158 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	4	5	18100


> New Y[]: 
	
	 0  0  1  0  3  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,225

## ITERATION 159 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	4	2	18700


> New Y[]: 
	
	 0  0  3  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,22

## ITERATION 160 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	7	18000


> New Y[]: 
	
	 0  0  1  0  1  2  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,215

## ITERATION 161 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	5	2	18100


> New Y[]: 
	
	 0  0  2  0  1  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,21

## ITERATION 162 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	4	18600


> New Y[]: 
	
	 0  0  1  0  2  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,205

## ITERATION 163 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	4	7	17800


> New Y[]: 
	
	 0  0  1  0  3  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,2

## ITERATION 164 #######################


> Neighbours evaluated; 9
> Selected Move:	780	4	4	2	18400


> New Y[]: 
	
	 0  0  3  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,195

## ITERATION 165 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	5	18400


> New Y[]: 
	
	 0  0  1  0  1  3  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  1  0 
 > pw :0,19

## ITERATION 166 #######################


> Neighbours evaluated; 8
> Selected Move:	780	3	5	1	16100


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,185

## ITERATION 167 #######################


> Neighbours evaluated; 27
> Selected Move:	877	1	-1	5	21100


> New Y[]: 
	
	 0  3  1  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,18

## ITERATION 168 #######################


> Neighbours evaluated; 16
> Selected Move:	924	3	7	6	21200


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,175

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	1030	3	2	7	21200


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,17

## ITERATION 170 #######################


> Neighbours evaluated; 23
> Selected Move:	1019	3	6	9	21300


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,165

## ITERATION 171 #######################


> Neighbours evaluated; 23
> Selected Move:	993	4	9	4	21500


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,17

## ITERATION 172 #######################


> Neighbours evaluated; 20
> Selected Move:	985	4	4	8	21500


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,175

## ITERATION 173 #######################


> Neighbours evaluated; 24
> Selected Move:	978	3	9	6	21500


> New Y[]: 
	
	 0  3  0  0  1  1  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,18

## ITERATION 174 #######################


> Neighbours evaluated; 21
> Selected Move:	970	4	8	4	21500


> New Y[]: 
	
	 0  3  0  0  2  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,185

## ITERATION 175 #######################


> Neighbours evaluated; 17
> Selected Move:	915	3	4	2	21000


> New Y[]: 
	
	 0  3  2  0  0  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,19

## ITERATION 176 #######################


> Neighbours evaluated; 20
> Selected Move:	929	4	2	5	20900


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,195

## ITERATION 177 #######################


> Neighbours evaluated; 23
> Selected Move:	925	3	6	9	20900


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,2

## ITERATION 178 #######################


> Neighbours evaluated; 21
> Selected Move:	900	4	5	2	21000


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,205

## ITERATION 179 #######################


> Neighbours evaluated; 20
> Selected Move:	875	3	5	4	21000


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,21

## ITERATION 180 #######################


> Neighbours evaluated; 21
> Selected Move:	902	3	2	3	20800


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,215

## ITERATION 181 #######################


> Neighbours evaluated; 21
> Selected Move:	898	3	9	6	20800


> New Y[]: 
	
	 0  3  0  2  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,22

## ITERATION 182 #######################


> Neighbours evaluated; 21
> Selected Move:	894	3	7	5	20800


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,225

## ITERATION 183 #######################


> Neighbours evaluated; 20
> Selected Move:	820	3	4	2	20800


> New Y[]: 
	
	 0  3  1  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 22
> Selected Move:	816	3	6	9	20800


> New Y[]: 
	
	 0  3  1  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,235

## ITERATION 185 #######################


> Neighbours evaluated; 21
> Selected Move:	788	3	3	4	21500


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,24

## ITERATION 186 #######################


> Neighbours evaluated; 19
> Selected Move:	828	4	4	9	21300


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,245

## ITERATION 187 #######################


> Neighbours evaluated; 20
> Selected Move:	782	3	4	7	21300


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,25

## ITERATION 188 #######################


> Neighbours evaluated; 22
> Selected Move:	800	3	9	6	21200


> New Y[]: 
	
	 0  3  1  0  0  1  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,255

## ITERATION 189 #######################


> Neighbours evaluated; 21
> Selected Move:	774	3	5	4	21200


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 21
> Selected Move:	780	2	8	-1	16700


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,265

## ITERATION 191 #######################


> Neighbours evaluated; 27
> Selected Move:	780	4	6	2	16500


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,27

## ITERATION 192 #######################


> Neighbours evaluated; 25
> Selected Move:	780	4	2	4	17000


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,275

## ITERATION 193 #######################


> Neighbours evaluated; 25
> Selected Move:	780	4	4	7	16100


> New Y[]: 
	
	 0  3  1  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,28

## ITERATION 194 #######################


> Neighbours evaluated; 23
> Selected Move:	920	3	2	5	16100


> New Y[]: 
	
	 0  3  0  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,285

## ITERATION 195 #######################


> Neighbours evaluated; 24
> Selected Move:	809	1	-1	9	20600


> New Y[]: 
	
	 0  3  0  0  1  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,29

## ITERATION 196 #######################


> Neighbours evaluated; 24
> Selected Move:	816	3	4	2	20600


> New Y[]: 
	
	 0  3  1  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 197 #######################


> Neighbours evaluated; 22
> Selected Move:	920	2	6	-1	16100


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 198 #######################


> Neighbours evaluated; 25
> Selected Move:	780	3	1	4	17800


> New Y[]: 
	
	 0  0  1  0  3  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1 
 > pw :0,285

## ITERATION 199 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	4	2	18400


> New Y[]: 
	
	 0  0  3  0  1  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1 
 > pw :0,28

## ITERATION 200 #######################


> Neighbours evaluated; 7
> Selected Move:	780	4	2	5	18400


> New Y[]: 
	
	 0  0  1  0  1  3  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1 
 > pw :0,275

## ITERATION 201 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	5	7	18000


> New Y[]: 
	
	 0  0  1  0  1  2  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 8
> Selected Move:	780	4	5	2	18100


> New Y[]: 
	
	 0  0  2  0  1  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1 
 > pw :0,265

## ITERATION 203 #######################


> Neighbours evaluated; 8
> Selected Move:	920	3	2	0	16100


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,26

## ITERATION 204 #######################


> Neighbours evaluated; 26
> Selected Move:	824	1	-1	6	20600


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,255
________________________________________________________________

Best solution found: 1400
Run Termination time: 03.02.2010 20:15:09
Run duration: 00:00:35.8125000
________________________________________________________________
